Finite graph-acceptors and regular graph-languages
نویسندگان
چکیده
منابع مشابه
(Re)introducing Regular Graph Languages
Distributions over strings and trees can be represented by probabilistic regular languages, which characterise many models in natural language processing. Recently, several datasets have become available which represent natural language phenomena as graphs, so it is natural to ask whether there is an equivalent of probabilistic regular languages for graphs. This paper presents regular graph lan...
متن کاملPartially Ordered Regular Languages for Graph Queries
In this paper we present an extension of regular languages to support graph queries. The proposed extension is based on the introduction of a partial order on the strings of the languages. We extend regular expressions and regular grammars by introducing partial orders on strings and production rules, respectively. The relations between regular expressions and regular grammars are analyzed. We ...
متن کاملRegular Description of Context-Free Graph Languages
A set of (labeled) graphs can be de ned by a regular tree language and one regular string language for each possible edge label, as follows. For each tree t from the regular tree language the graph gr(t) has the same nodes as t (with the same labels), and there is an edge with label from node x to node y if the string of labels of the nodes on the shortest path from x to y in t belongs to the r...
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملLanguages with Finite Antidictionaries: Growth Rates and Graph Properties
The factorial languages with finite antidictionaries and exponential complexity functions are studied, together with their recognizing automata. Impromevents are added to the algorithm evaluating the growth rate. Some graph properties of recognizing automata are proved, and binary languages with small recognizing automata are classified.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1981
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(81)90351-x